Automaticity of double sequences generated by one-dimensional linear cellular automata
نویسندگان
چکیده
منابع مشابه
Automaticity of Double Sequences Generated by One-Dimensional Linear Cellular Automata
We give a complete answer to the question whether a double sequence that is generated by a one-dimensional linear cellular automaton, and whose states are integers modulo m, is k-automatic or not.
متن کاملPseudo-random Sequences Generated by Cellular Automata
Generation of pseudo random sequences by cellular automata, as well as by hybrid cellular automata is surveyed. An application to the fast evaluation and FPGA implementation of some classes of boolean functions is sketched out.
متن کاملTransductions Computed by One-Dimensional Cellular Automata
Cellular automata are investigated towards their ability to compute transductions, that is, to transform inputs into outputs. The families of transductions computed are classified with regard to the time allowed to process the input and to compute the output. Since there is a particular interest in fast transductions, we mainly focus on the time complexities real time and linear time. We first ...
متن کاملSynthesis of one-dimensional linear hybrid cellular automata
Plus BROWSE SEARCH IEEE XPLORE GUIDE View TOC | Previous Article | Next Article Synthesis of one-dimensional linear hybrid cellular autom Cattell, K. Muzio, J.C. Dept. of Comput. Sci., Victoria Univ., BC; This paper appears in: Computer-Aided Design of Integrated Circuits and Systems, on Publication Date: Mar 1996 Volume: 15, Issue: 3 On page(s): 325-335 ISSN: 0278-0070 References Cited: 20 COD...
متن کاملBounds for One-dimensional Cellular Automata: A Linear Algebraic Approach
In [CK05], E. Czeizler and J. Kari used a linear algebraic tool to obtain good upper bounds for the length of the inverse neighbourhood of reversible one-dimensional cellular automata (CA). Recently, a linear algebraic approach similar to the one used by J. Kari in [Kar03], lead to better upper bounds for the length of the shortest unbalanced words, shortest orphans and shortest diamonds of non...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00298-8